On the Convergence of Iterated Exponentiation—11*
نویسنده
چکیده
1. A. F. Horadam. "Basic Properties of a Certain Generalized Sequence of Numbers." The Fibonacci Quarterly 3 (1965):161-75. 2. A. F. Horadam. "Complex Fibonacci Numbers and Fibonacci Quaternions." Amer. Math. Monthly 70 (1963):289-91. 3. A. L. Iakin. "Generalized Quaternions with Quaternion Components." The Fibonacci Quarterly 15 (1977):35Q-52. 4. A. L. Iakin. "Generalized Quaternions of Higher Order." The Fibonacci Quarterly 15 (1977):343-46. 5. A. L. Iakin. "Extended Binet Forms for Generalized Quaternions of Higher Order." (To be published.) 6. M. R. Iyer. "A Note on Fibonacci Quaternions." The Fibonacci Quarterly 1 (1969):225-29. 7. M.N. S. Swamy. "On Generalized Fibonacci Quaternions." The Fibonacci Quarterly 11 (1973):547-49.
منابع مشابه
On the Convergence of Iterated Exponentiation—i
1. R. L. Adler & T. J. Rivlin. "Ergodic and Mixing Properties of Chebyshev Polynomials." Proa. Amer. Math. Soc. 15 (1964) :79'4-7'96. 2. P. Johnson & A. Sklar. "Recurrence and Dispersion under Iteration of Cebysev Polynomials." To appear. 3. C.H. Kimberling. "Four Composition Identities for Chebyshev Polynomials." This issue, pp. 353-369. 4. T. J. Rivlin. The Chebyshev Polynomials. New York: Wi...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملConstant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
We study the complexity of arithmetic in finite fields of characteristic two, F2n . We concentrate on the following two problems: • Iterated Multiplication: Given α1, α2, . . . , αt ∈ F2n , compute α1 · α2 · · ·αt ∈ F2n . • Exponentiation: Given α ∈ F2n and a t-bit integer k, compute α k ∈ F2n . First, we consider the explicit realization of the field F2n as F2[x]/(x 2·3l +x3 l +1) ' F2n , wher...
متن کاملOn the Convergence of Iterated Exponentiation — Iii
(2) f(x) E F(x9 x)9 i.e., the case of Eq. (1) where x = y. For both Eqs. (1) and (2), the ordering of the exponentiations is important, and for Eq. (1) and throughout this paper, we mean a bracketing order "from the top down," i.e., x raised to the power y9 followed by y raised to the power x^, and then x raised to the power y^\ and so on, all the way down to the x which is at the lowest positi...
متن کامل